Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the multiple systems simultaneously. This paper compares a block generalisation of the quasi-minimal residual method (QMR), Block Conjugate Gradient on the normal equation, Block Lanczos and ($\gamma_5$-symmetric) Block BiConjugate Gradient.
展开▼
